Determining Acceptance Possibility for a Quantum Computation is Hard for PH
نویسندگان
چکیده
It is shown that determining whether a quantum computation has a nonzero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation.
منابع مشابه
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation...
متن کاملQuantum Np Is Hard for Ph
In analogy with NP, a language L is in the class NQP if the strings in L are exactly those accepted by a polynomial-time quantum machine with non-zero probability. Previously, Adleman, Demarrais and Huang showed that NQP PP. The sharper upper bound NQP coC=P is implicit in Adleman et al. and results of Fortnow and Rogers. Here we prove that in fact NQP and coC=P are the same class, by showing t...
متن کاملQuantum Commuting Circuits and Complexity of Ising Partition Functions
Abstract Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy (PH) collapses at the third level, which is highly impl...
متن کاملQuantum Computer II
This is a sequel to the papers (quant-ph/9910063) and (quant-ph/0004102). The aim of this paper is to give mathematical foundations to Holonomic Quantum Computation (Computer) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093). In 2-qubit case we give an explicit form to non-abelian Berry connection of quantum computational bundle which is associated...
متن کاملA N–Level System Interacting with Single Radiation Mode and Multi Cat States of Schrödinger in the Strong Coupling Regime
In this paper we consider some (generalized) models which deal with n–level atom interacting with a single radiation mode and study a general structure of Rabi floppings of these generalized ones in the strong coupling regime. To solve these models we introduce multi cat states of Schrödinger in our terminology and extend the result in (quant–ph/0203135) which Rabi frequencies are given by matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997